Homomorphic public-key systems based on subgroup membership problems
نویسنده
چکیده
We describe the group structure underlying several popular homomorphic public-key systems and the problems they are based on. We prove several well-known security results using only the group structure and assumptions about the related problems. Then we provide examples of two new instances of this group structure and analyse their security.
منابع مشابه
Homomorphic public-key cryptosystems over groups and rings
We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity nite group based on the di culty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the rst time over nite commutative rings.
متن کاملSymmetric Subgroup Membership Problems
We define and discuss symmetric subgroup membership problems and their properties, including a relation to the Decision DiffieHellman problem. We modify the Cramer-Shoup framework, so that we can derive a chosen ciphertext secure cryptosystem in the standard model from symmetric subgroup membership problems. We also discuss how chosen ciphertext secure hybrid cryptosystems based on a symmetric ...
متن کاملHomomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Previous systems for computing on signed data could only handle linear operations. For polynomials of...
متن کاملUsing the Subgroup Membership Search Problem in Public Key Cryptography
There are several public key protocols around that use the computational hardness of either the conjugacy search problem or the word (search) problem for nonabelian groups. In this paper, we describe a cryptosystem whose security is based on the computational hardness of the subgroup membership (search) problem: given a group G, a subgroup H generated by h1, . . . , hk, and an element h ∈ H, fi...
متن کاملOn FHE Without Bootstrapping (Informal)
We investigate the use of multivariate polynomials in constructing a fully homomorphic encryption. In this work we come up with two fully homomorphic schemes. First, we propose an IND-CPA secure symmetric key homomorphic encryption scheme using multivariate polynomial ring over finite fields. This scheme gives a method of constructing a CPA secure homomorphic encryption scheme from another symm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003